Heavy and light traffic in fluid models with burst arrivalsSIGMAN, K; YAMAZAKI, G.Annals of the Institute of Statistical Mathematics. 1993, Vol 45, Num 1, pp 1-7, issn 0020-3157Article

Round robin scheduling of heterogeneous parallel servers in heavy trafficRONG WU; DOWN, Douglas G.European journal of operational research. 2009, Vol 195, Num 2, pp 372-380, issn 0377-2217, 9 p.Article

DIFFUSION APPROXIMATION OF STATE-DEPENDENT G-NETWORKS UNDER HEAVY TRAFFICLEITE, Saul C; FRAGOSO, Marcelo D.Journal of applied probability. 2008, Vol 45, Num 2, pp 347-362, issn 0021-9002, 16 p.Article

Heavy-traffic asymptotics for stationary GI/G/1-type Markov chainsKIMURA, Tatsuaki; MASUYAMA, Hiroyuki; TAKAHASHI, Yutaka et al.Operations research letters. 2012, Vol 40, Num 3, pp 185-189, issn 0167-6377, 5 p.Article

On the average sojourn time under M/M/1/SRPTBANSAL, Nikhil.Operations research letters. 2005, Vol 33, Num 2, pp 195-200, issn 0167-6377, 6 p.Article

Heavy-traffic theory for the heavy-tailed M/G/1 queue and ν-stable Levy noise trafficCOHEN, J. W.Report - Probability, networks and algorithms. 1998, Num 5, pp 1-16, issn 1386-3711Article

Polling systems with periodic server routing in heavy trafficVAN DER MEI, R. D.Communications in statistics. Stochastic models. 1999, Vol 15, Num 2, pp 273-297, issn 0882-0287Article

Hazard Rate Scaling of the Abandonment Distribution for the GI/M/n + GI Queue in Heavy TrafficREED, Josh; TEZCAN, Tolga.Operations research. 2012, Vol 60, Num 4, pp 981-995, issn 0030-364X, 15 p.Article

Service-Level Agreements in Call Centers : Perils and PrescriptionsMILNER, Joseph M; LENNON OLSEN, Tava.Management science. 2008, Vol 54, Num 2, pp 238-252, issn 0025-1909, 15 p.Article

Two fluid approximations for multi-server queues with abandonmentsWHITT, Ward.Operations research letters. 2005, Vol 33, Num 4, pp 363-372, issn 0167-6377, 10 p.Article

Polling systems with periodic server routing in heavy traffic: renewal arrivalsOLSEN, Tava Lennon; VAN DER MEI, R. D.Operations research letters. 2005, Vol 33, Num 1, pp 17-25, issn 0167-6377, 9 p.Article

A simple proof of diffusion approximations for LBFS re-entrant linesJIANKUI YANG; DAI, J. G; YOU, Jian-Gong et al.Operations research letters. 2006, Vol 34, Num 2, pp 199-204, issn 0167-6377, 6 p.Article

Role of connectivity in congestion and decongestion in a communication networkGUPTE, N; SINGH, B. K.The European physical journal. B, Condensed matter physics. 2006, Vol 50, Num 1-2, pp 227-230, issn 1434-6028, 4 p.Conference Paper

A rate separation mechanism for performance improvements of multi-rate WLANsIM, Chae-Tae; KWON, Dong-Hee; SUH, Young-Joo et al.Lecture notes in computer science. 2005, pp 368-377, issn 0302-9743, isbn 3-540-25860-4, 4Vol, 10 p.Conference Paper

Agent chaining: An approach to dynamic mobile agent planningBAEK, Jin-Wook; YEO, Jae-Heung; YEOM, Heon-Young et al.Proceedings of the ... International Conference on Distributed Computing Systems. 2002, pp 579-586, issn 1063-6927, isbn 0-7695-1585-1, 8 p.Conference Paper

Heavy traffic approximations of large deviations of feedforward queueing networksMAJEWSKI, K.Queueing systems. 1998, Vol 28, Num 1-3, pp 125-155, issn 0257-0130Article

Sequential bottleneck decomposition : an approximation method for generalized Jackson networksDAI, J. G; NGUYEN, V; REIMAN, M. I et al.Operations research. 1994, Vol 42, Num 1, pp 119-136, issn 0030-364XArticle

A simple relationship between light and heavy traffic limitsSIMON, B.Operations research. 1992, Vol 40, pp S342-S345, issn 0030-364X, SUP2Article

A System-Awareness Decision Classifier to Automated MSN ForensicsCHU, Yin-Teshou Tsao; FAN, Kuo-Pao; CHENG, Ya-Wen et al.Proceedings of SPIE, the International Society for Optical Engineering. 2007, pp 67760O.1-67760O.9, issn 0277-786X, isbn 978-0-8194-6936-6, 1VolConference Paper

Improvement of borrowing channel assignment for patterned traffic load by online cellular probabilistic self-organizing mapSITAO WU; CHOW, Tommy W. S; KAI TAT NG et al.Neural computing & applications (Print). 2006, Vol 15, Num 3-4, pp 298-309, issn 0941-0643, 12 p.Article

Path Loss Rate Driven Burst Assembly in OBS NetworksKANTARCI, Burak; OKTUG, Sema.Lecture notes in computer science. 2006, pp 483-492, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 10 p.Conference Paper

Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributionsBOXMA, O. J; COHEN, J. W.Report - Probability, networks and algorithms. 1997, Num 10, pp 1-28, issn 1386-3711Article

On a heavy traffic limit theorem for the M/G/1 processor-sharing queueYASHKOV, S. F.Communications in statistics. Stochastic models. 1993, Vol 9, Num 3, pp 467-471, issn 0882-0287Article

A genetic algorithm for controlling elevator group systemsCORTES, P; LARRANETA, J; ONIEVA, L et al.Lecture notes in computer science. 2003, pp 313-320, issn 0302-9743, isbn 3-540-40211-X, 8 p.Conference Paper

Packet analysis in congested networksFUKUSHIMA, Masaki; GOTO, Shigeki.Progress in discovery science (final report of the Japanese discovery science project). Lecture notes in computer science. 2002, pp 600-615, issn 0302-9743, isbn 3-540-43338-4Book Chapter